An Arithmetical Characterization of the Convex Hull of Digital Straight Segments
نویسنده
چکیده
In this paper, we arithmetically describe the convex hull of a digital straight segment by three recurrence relations. This characterization gives new insights into the combinatorial structure of digital straight segments of arbitrary length and intercept. It also leads to two on-line algorithms that computes a part of the convex hull of a given digital straight segment. They both run in constant space and constant time per vertex. Due to symmetries, they are enough to reconstruct the whole convex hull. Moreover, these two algorithms provide e cient solutions to the subsegment problem, which consists in computing the minimal parameters of a segment of a digital straight line of known parameters.
منابع مشابه
Local convexity properties of digital curves
The paper studies local convexity properties of digital curves. We locally define convex and concave parts from the slope of maximal digital straight segments and arithmetically characterize the smallest digital pattern required for checking convexity. Moreover, we introduce the concepts of digital edge and digital hull, a digital hull being a sequence of increasing or decreasing digital edges....
متن کاملAlgorithm for computing the digital con- vex fuzzy hull
The problem of finding the digital convex fuzzy hull of a digital fuzzy set, whose support is made of some digital points (centroids) in Z, is considered here. A region is DL−convex if, for any two pixels belonging to it, there exists a digital straight line between them, all of whose pixels belong to the region. An algorithm how to compute the DL−convex hull of a digital region is described. A...
متن کاملWhat Does Digital Straightness Tell about Digital Convexity?
The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary into convex and concave parts. In addition, other data are computed in the same time without any extra cost: the hull of each convex or concave part as well as the Bezout points of each edge of those hulls. The proposed algori...
متن کاملEuclidean farthest-point Voronoi diagram of a digital edge
A digital edge is a digitization of a straight segment joining two points of integer coordinates. Such a digital set may be analytically defined by the rational slope of the straight segment. We show in this paper that the convex hull, the Euclidean farthest-point Voronoi diagram as well as the dual farthest-point Delaunay triangulation of a digital edge can be fully described by the continued ...
متن کاملVertices of the digital line/(hyper)plane segment polytope
We consider the following problem. Given an 8-digital straight line segment (8-DSS) of length n, estimate the number of vertices of its convex hull. Taking advantage of known results from polyhedral combinatorics, we answer this question and its generalization to higher dimensions. We also address algorithmic issues and provide relevant references.
متن کامل